分类:全部列表
[LeetCode]103.BinaryTreeZigzagLevelOrderTraversal二叉树的之字形层序遍历Givenabinarytree,returnthe zigzaglevelorder traversalofitsnodes'values.(ie,fromlefttoright,thenrighttoleftforthenextlevelandalternatebetween).Forexample:Givenbinarytree [3,9,20,null,null,15,7], 3/\9 20/ \15 7returnitszigzaglevelo...
继续阅读 >
[LeetCode]107.BinaryTreeLevelOrderTraversalII二叉树层序遍历之二Giventhe root ofabinarytree,return thebottom-uplevelordertraversalofitsnodes'values.(i.e.,fromlefttoright,levelbylevelfromleaftoroot).Example1:Input:root=[3,9,20,null,null,15,7]Output:[[15,7],[9,20],[3]]Example2:Input:root=[1]Output:[[1]]Example3:Input:root=[]Output:[]Const...
继续阅读 >
[LeetCode]102.BinaryTreeLevelOrderTraversal二叉树层序遍历Givenabinarytree,returnthe levelorder traversalofitsnodes'values.(ie,fromlefttoright,levelbylevel).Forexample:Givenbinarytree {3,9,20,#,#,15,7}, 3/\9 20/ \15 7returnitslevelordertraversalas:[[3],[9,20],[15,7]]层序遍历二叉树是典型的广度优先搜索BFS的应...
继续阅读 >