Validate Binary Tree Nodes (Leetcode 1361)
Amazon, Microsoft, Google, Facebook, Netflix, Apple
You have n binary tree nodes numbered from 0 to n - 1 where node i has two children leftChild[i] and rightChild[i], return true if and only if all the given nodes form exactly one valid binary tree.
If node i has no left child then leftChild[i] will equal -1, similarly for the right child.
Note that the nodes have no values and that we only use the node numbers in this problem.
On this page of the site you can watch the video online Validate Binary Tree Nodes (Leetcode 1361) with a duration of hours minute second in good quality, which was uploaded by the user Coding Interviews 07 March 2020, share the link with friends and acquaintances, this video has already been watched 5,665 times on youtube and it was liked by 62 viewers. Enjoy your viewing!
