What Did We Learn?
Accomplishments
In this chapter, you’ve done the following:
-
Applied BFS to an n-ary tree
-
Located the LCA of two nodes in an n-ary tree
-
Assigned next pointers in each node of an n-ary tree to the immediate right node for a more efficient ...
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy