6 docs tagged with "Tree"

Given the root of a binary tree, then value v and depth d, you need to add a row of nodes with value v at the given depth d. The root node is at depth 1.

Given a binary tree, return the inorder traversal of its nodes' values.

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

Given a non-empty binary tree, find the maximum path sum.

Given a binary tree, return the postorder traversal of its nodes' values.

Given a binary tree, return the preorder traversal of its nodes' values.