Hướng dẫn print level wise binary tree python - cấp in cây nhị phân khôn ngoan python

Cho gốc của cây nhị phân. Nhiệm vụ là in các đường ngang cấp của một cây là đường truyền đầu tiên cho cây. & Nbsp;root of the Binary Tree. The task is to print the Level order traversal of a tree is breadth first traversal for the tree. 

Input:

Hướng dẫn print level wise binary tree python - cấp in cây nhị phân khôn ngoan python

Đầu ra: 12 34 5 & nbsp;
1
2 3
4 5 

Input:

Hướng dẫn print level wise binary tree python - cấp in cây nhị phân khôn ngoan python

Đầu ra: 208 224 1210 14
20
8 22
4 12
10 14

Đơn hàng cấp độ của cây nhị phân bằng cách sử dụng đệ quy:

Dưới đây là ý tưởng để giải quyết vấn đề:

In các đường ngang cấp của cây bằng cách sử dụng hàm đệ quy để đi qua tất cả các nút của một cấp độ. Tìm chiều cao của cây và chạy độ sâu tìm kiếm đầu tiên và duy trì chiều cao hiện tại, in các nút cho mọi chiều cao từ gốc và cho chiều cao từ 1 đến chiều cao nếu chiều cao hiện tại bằng chiều cao của phép lặp sau đó in dữ liệu nút.height of tree and run depth first search and maintain current height, print nodes for every height from root and for 1 to height and match if the current height is equal to height of the iteration then print node’s data.

Thực hiện theo các bước dưới đây để thực hiện ý tưởng:

  • Chạy A cho vòng lặp cho bộ đếm I, tức là chiều cao hiện tại từ 1 đến H (chiều cao của cây).current height from 1 to h (height of the tree).
  • Sử dụng DFS để đi qua cây và duy trì chiều cao cho nút hiện tại.
    • Nếu nút là null thì quay lại;
    • Nếu mức là 1 in (cây-> dữ liệu);
    • Nếu mức độ lớn hơn 1, thì
      • Gọi đệ quy đến cây-> trái, cấp 1.
      • Gọi đệ quy đến Tree-> Phải, Cấp 1.

Dưới đây là việc thực hiện phương pháp trên:

C++

#include

using namespace std;

class node {

public:

Level Order traversal of binary tree is 
1 2 3 4 5 
0____11
Level Order traversal of binary tree is 
1 2 3 4 5 
2

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
4

Level Order traversal of binary tree is 
1 2 3 4 5 
5

Level Order traversal of binary tree is 
1 2 3 4 5 
6
Level Order traversal of binary tree is 
1 2 3 4 5 
7
Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
9

Level Order traversal of binary tree is 
1 2 3 4 5 
1 #include 1

#include 2

Level Order traversal of binary tree is 
1 2 3 4 5 
1 #include 4

Level Order traversal of binary tree is 
1 2 3 4 5 
6 #include 6

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
1 using0

Level Order traversal of binary tree is 
1 2 3 4 5 
0____11 using3

Level Order traversal of binary tree is 
1 2 3 4 5 
0using5 using6

using7using8

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
6
Level Order traversal of binary tree is 
1 2 3 4 5 
7
Level Order traversal of binary tree is 
1 2 3 4 5 
1 namespace3

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace6 namespace7

using7namespace9std;0

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace6 std;3

using7std;5std;6std;0

Level Order traversal of binary tree is 
1 2 3 4 5 
0std;9 namespace6 class1

using7class3

using7class5

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
1 node {0

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace6 node {4

using7namespace9 node {7

Level Order traversal of binary tree is 
1 2 3 4 5 
0std;9 #include 7

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
1 public3

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
1 public6

using7namespace6 public9

:0namespace9 :2

using7using9

using7std;9 #include 7

:0namespace9

Level Order traversal of binary tree is 
1 2 3 4 5 
00

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

#include 2

Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
08

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
11
Level Order traversal of binary tree is 
1 2 3 4 5 
12
Level Order traversal of binary tree is 
1 2 3 4 5 
13

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
15

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
17

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
19

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace9
Level Order traversal of binary tree is 
1 2 3 4 5 
22

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
25

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
28

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
30

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
32

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
34

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
36

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
38
Level Order traversal of binary tree is 
1 2 3 4 5 
39std;0

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
42

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace9 node {7

using9

C

Level Order traversal of binary tree is 
1 2 3 4 5 
47

Level Order traversal of binary tree is 
1 2 3 4 5 
48

Level Order traversal of binary tree is 
1 2 3 4 5 
49 node {

Level Order traversal of binary tree is 
1 2 3 4 5 
0____11
Level Order traversal of binary tree is 
1 2 3 4 5 
2

Level Order traversal of binary tree is 
1 2 3 4 5 
6
Level Order traversal of binary tree is 
1 2 3 4 5 
7
Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
9

Level Order traversal of binary tree is 
1 2 3 4 5 
5

Level Order traversal of binary tree is 
1 2 3 4 5 
1 #include 1

#include 2

Level Order traversal of binary tree is 
1 2 3 4 5 
1 #include 4

Level Order traversal of binary tree is 
1 2 3 4 5 
6 #include 6

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
1 using0

Level Order traversal of binary tree is 
1 2 3 4 5 
0____11 using3

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
1 using0

Level Order traversal of binary tree is 
1 2 3 4 5 
0____11 using3

Level Order traversal of binary tree is 
1 2 3 4 5 
0using5 using6

using7using8

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
6
Level Order traversal of binary tree is 
1 2 3 4 5 
7
Level Order traversal of binary tree is 
1 2 3 4 5 
1 namespace3

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace6 namespace7

using7namespace9std;0

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace6 std;3

using7#include 06#include 07#include 08#include 09

Level Order traversal of binary tree is 
1 2 3 4 5 
0std;9 namespace6 class1

using7class3

using7class5

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
1 node {0

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace6 node {4

using7namespace9 node {7

Level Order traversal of binary tree is 
1 2 3 4 5 
0std;9 #include 7

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
1 public3

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
1 public6

using7namespace6 public9

:0namespace9 :2

using7std;9

:0namespace9

Level Order traversal of binary tree is 
1 2 3 4 5 
00

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

#include 2

Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
08

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
11
Level Order traversal of binary tree is 
1 2 3 4 5 
12
Level Order traversal of binary tree is 
1 2 3 4 5 
13

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace9
Level Order traversal of binary tree is 
1 2 3 4 5 
22

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 74

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 76

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 78

Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
25

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
25

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
34

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
30

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
32

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
34

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
36

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 06#include 07
Level Order traversal of binary tree is 
1 2 3 4 5 
39using01

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
42

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace9 node {7

using9

C

Level Order traversal of binary tree is 
1 2 3 4 5 
49 node {

Level Order traversal of binary tree is 
1 2 3 4 5 
0____11
Level Order traversal of binary tree is 
1 2 3 4 5 
2

Level Order traversal of binary tree is 
1 2 3 4 5 
0using14

Level Order traversal of binary tree is 
1 2 3 4 5 
6
Level Order traversal of binary tree is 
1 2 3 4 5 
7
Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
9

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7using23

using7using25using26std;0

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
1 #include 1

Level Order traversal of binary tree is 
1 2 3 4 5 
0using34

____10public using37using26using39

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
6 using42

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
1 using0

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
1 using3

using7using5 using53using54using55

:0using8

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0____11 using62

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7namespace6 using67using26using69

:0namespace9 using72std;0

using7std;9 #include 7

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
1 using79

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
1 using82

:0namespace6 #include 43

using86namespace9 using88using54using01

:0std;9

using86namespace9 using95using54using01

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0____16 namespace04
Level Order traversal of binary tree is 
1 2 3 4 5 
1 namespace3

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7namespace6 using67using26using69

:0namespace9std;0

:0namespace9 using72std;0

:0namespace23std;6using01

using7std;9 #include 7

:0namespace33using54using01

:0namespace37using54using01

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
1 using79

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
1 using82

:0namespace6 #include 43

using86namespace9 using88using54using01

using86namespace9 using95using54using01

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0____16 namespace04
Level Order traversal of binary tree is 
1 2 3 4 5 
1 namespace3

using7namespace86namespace87

namespace88namespace89namespace90using01

using7namespace93

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

Python3

using7namespace6 namespace19using54using69

using7std;9 namespace6 namespace29using54namespace31

Level Order traversal of binary tree is 
1 2 3 4 5 
0public namespace46
Level Order traversal of binary tree is 
1 2 3 4 5 
6 namespace48

using7namespace52

Level Order traversal of binary tree is 
1 2 3 4 5 
12 namespace54

using7namespace56

Level Order traversal of binary tree is 
1 2 3 4 5 
12 using17using54using01

using7namespace62

Level Order traversal of binary tree is 
1 2 3 4 5 
12 using17namespace65using01

using7namespace68

Level Order traversal of binary tree is 
1 2 3 4 5 
12 using17namespace71using01

using7namespace74

Level Order traversal of binary tree is 
1 2 3 4 5 
12 using17namespace777using01

using7std;37

using7namespace80

Level Order traversal of binary tree is 
1 2 3 4 5 
12 using17namespace83using01

class namespace98

using7namespace9

____10std;00 std;01std;022

using7std;56std;57std;07std;6using69

Các

using7std;67std;68using54using69

using7std;72std;68using54using69

using7std;025____511std;07 std;13

using7std;022516std;07 std;13

std;00 std;20

Level Order traversal of binary tree is 
1 2 3 4 5 
0std;9:

Level Order traversal of binary tree is 
1 2 3 4 5 
0std;222std;07 std;24

Level Order traversal of binary tree is 
1 2 3 4 5 
0using5 std;27std;28 std;29#include 07____354std;32std;33using54std;35

std;00 std;39

____10namespace6 std;42std;43 std;13:

using7std;9:

____10namespace6 std;50std;07std;07 using54:

____10std;62 std;63using54:

std;00 std;77

____10namespace6 std;80std;43 std;13:

using7namespace9 using72

using7std;91std;07 std;93

std;56#include 07class41using69

class43

C#

using7std;95std;07 std;97

using7namespace6 class00

:0namespace9 class03std;33using54

:0namespace9 class11std;33using54

std;42std;07 using17using54using69

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7using23

using7using25using26std;0

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

class19std;07 using17namespace65using69

class24std;07 using17namespace71using69

class29std;07 using17namespace77using69

class34std;07 using17namespace83using69

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
1 using0

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
1 using3

using class45

:0using8

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

public class using09

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0__
Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
2

Level Order traversal of binary tree is 
1 2 3 4 5 
0public using14

using7using9

using7std;9 #include 7

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
1 using79

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
1 using82

:0namespace6 #include 43

using86namespace9 using88using54using01

:0using9

using86namespace9 using95using54using01

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

:0using9

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0____16 namespace04
Level Order traversal of binary tree is 
1 2 3 4 5 
1 namespace3

node {56

Level Order traversal of binary tree is 
1 2 3 4 5 
1 namespace3

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7namespace6 using67using26namespace31

:0namespace9std;0

using7using9

using7namespace6 node {73

:0node {75std;6using01

using7using9

using7std;9 namespace6 class1

:0node {85

:0node {87

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0______

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7public022 public04

using7namespace56

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public08

using7namespace62

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public12

using7namespace68

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public16

using7namespace74

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public20

using7namespace80

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public24

using7public26public27

public28namespace89public30using01

using7namespace93

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

JavaScript

public37

public38public39

using7public41

:0public43public44

:0public43public47using26std;0

:0public43public52using26std;0

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

____10public60 public61using26std;0

Level Order traversal of binary tree is 
1 2 3 4 5 
0public65 public66

using7public60 using0

using7public60 using3

using7using5 using6

:0using8

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0public65 public82

using7namespace6 using67using26using69

:0namespace9 node {7

using7std;9 #include 7

:0public60 using79

:0public60 using82

:0namespace6 #include 43

using86namespace9 :2

:0std;9

using86namespace9

Level Order traversal of binary tree is 
1 2 3 4 5 
00

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0public65 :17

using7namespace6 using67using26using69

:0namespace9std;0

:0namespace9 node {7

using7std;9 #include 7

using7std;9 namespace6 class1

:0node {85

:0node {87

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0______

using7public022 public04

using7namespace56

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public08

using7namespace62

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public12

:65:66:67using01

:65:70

:71

using7namespace68

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public16

Level Order traversal of binary tree is 
1 2 3 4 5 

using7namespace74

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public20 O(N2), where N is the number of nodes in the skewed tree. So time complexity of printLevelOrder() is O(n) + O(n-1) + O(n-2) + .. + O(1) which is O(N2). 
Auxiliary Space:  O(N) in the worst case. For a skewed tree, printGivenLevel() uses O(n) space for the call stack. For a Balanced tree, the call stack uses O(log n) space, (i.e., the height of the balanced tree). 

using7namespace80Level Order traversal of binary tree is 1 2 3 4 5 12 public24

JavaScript

____10public60 public61using26std;0

  • Level Order traversal of binary tree is 
    1 2 3 4 5 
    0public65 public66q and push root in q.
  • using7public60 using0q is not empty. 
    • using7public60 using3
    • using7using5 using6
    • Level Order traversal of binary tree is 
      1 2 3 4 5 
      0public65 public82

using7namespace6 using67using26using69

C++

#include

:0namespace9 node {7

using7std;9 #include 7

:0public60 using79

:0public60 using82

Level Order traversal of binary tree is 
1 2 3 4 5 
5

:0namespace6 #include 43

#include 7

using86namespace9 :2

using7namespace9std;0

Level Order traversal of binary tree is 
1 2 3 4 5 
0:95

Level Order traversal of binary tree is 
1 2 3 4 5 
0:97

using86namespace9

Level Order traversal of binary tree is 
1 2 3 4 5 
00

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
004

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
006std;6std;0

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
010

Level Order traversal of binary tree is 
1 2 3 4 5 
0public65 :17

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
015

using7namespace6 std;3

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
020

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

:0:30std;6using01

#include 7

using7:46

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public08

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
033

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
035

using7:50

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public12

using9

using7:54

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public16

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
044

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
30

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
32

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
34

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
36

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
38
Level Order traversal of binary tree is 
1 2 3 4 5 
39std;0

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
42

using7:58

Level Order traversal of binary tree is 
1 2 3 4 5 
12 public20

using9

using7:62Level Order traversal of binary tree is 1 2 3 4 5 12 public24

Đầu ra

Level Order traversal of binary tree is 
1 2 3 4 5 
48

Level Order traversal of binary tree is 
1 2 3 4 5 
065

Độ phức tạp về thời gian: O (N2), trong đó n là số lượng nút trong cây bị lệch. Vì vậy, độ phức tạp thời gian của printlevelOrder () là O (n) + O (n-1) + O (n-2) + .. + o (1) là O (n2). & Nbsp; không gian phụ trợ: & nbsp; o (o ( N) trong trường hợp xấu nhất. Đối với một cây bị lệch, printgivenLevel () sử dụng không gian O (n) cho ngăn xếp cuộc gọi. Đối với một cây cân bằng, ngăn xếp cuộc gọi sử dụng không gian o (log n), (tức là chiều cao của cây cân bằng). & Nbsp;

:0public60 using79

:0public60 using82

:0namespace6 #include 43

Level Order traversal of binary tree is 
1 2 3 4 5 
5

using86namespace9 :2

Level Order traversal of binary tree is 
1 2 3 4 5 
6
Level Order traversal of binary tree is 
1 2 3 4 5 
085
Level Order traversal of binary tree is 
1 2 3 4 5 
49

Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
093
Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
087
Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
083

Level Order traversal of binary tree is 
1 2 3 4 5 
6
Level Order traversal of binary tree is 
1 2 3 4 5 
73
Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
75

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0____11
Level Order traversal of binary tree is 
1 2 3 4 5 
105

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
108

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
111

Level Order traversal of binary tree is 
1 2 3 4 5 
0:99
Level Order traversal of binary tree is 
1 2 3 4 5 
114

using7#include 06#include 07#include 08

Level Order traversal of binary tree is 
1 2 3 4 5 
119

using7namespace6

Level Order traversal of binary tree is 
1 2 3 4 5 
122

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
124

using7namespace6

Level Order traversal of binary tree is 
1 2 3 4 5 
127

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
129

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
131

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
079
Level Order traversal of binary tree is 
1 2 3 4 5 
1____1138
Level Order traversal of binary tree is 
1 2 3 4 5 
1____1140

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
144
Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
146#include 67#include 07

using7#include 69#include 07

Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
153

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
155

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace9
Level Order traversal of binary tree is 
1 2 3 4 5 
158

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
6
Level Order traversal of binary tree is 
1 2 3 4 5 
085
Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
163
Level Order traversal of binary tree is 
1 2 3 4 5 
1____1165

Level Order traversal of binary tree is 
1 2 3 4 5 
166
Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
168

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
171

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
173

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
093
Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
163
Level Order traversal of binary tree is 
1 2 3 4 5 
1____1180

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
183

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace9
Level Order traversal of binary tree is 
1 2 3 4 5 
186

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
49 #include 2
Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
08

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
49 #include 62

Các

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 74

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 76

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 78

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace9 #include 81

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
25

#include 7

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
49
Level Order traversal of binary tree is 
1 2 3 4 5 
28

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
30

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
32

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
34

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
36

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 06#include 07
Level Order traversal of binary tree is 
1 2 3 4 5 
39using01

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
42

Level Order traversal of binary tree is 
1 2 3 4 5 
0namespace9 node {7

using9

Java

Level Order traversal of binary tree is 
1 2 3 4 5 
241
Level Order traversal of binary tree is 
1 2 3 4 5 
242

Level Order traversal of binary tree is 
1 2 3 4 5 
241
Level Order traversal of binary tree is 
1 2 3 4 5 
244

class using09

Level Order traversal of binary tree is 
1 2 3 4 5 
0____11
Level Order traversal of binary tree is 
1 2 3 4 5 
2

Level Order traversal of binary tree is 
1 2 3 4 5 
0using14

Level Order traversal of binary tree is 
1 2 3 4 5 
0____8 using17
Level Order traversal of binary tree is 
1 2 3 4 5 
1 using19

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7using23

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
262using26std;0

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
266using26std;0

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

class using32

Level Order traversal of binary tree is 
1 2 3 4 5 
0using34

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
6 using42

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
282
Level Order traversal of binary tree is 
1 2 3 4 5 
12
Level Order traversal of binary tree is 
1 2 3 4 5 
284

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
286

using7:99

Level Order traversal of binary tree is 
1 2 3 4 5 
289

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
291

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
293std;6using01

:0namespace6

Level Order traversal of binary tree is 
1 2 3 4 5 
298using26namespace31

using86

Level Order traversal of binary tree is 
1 2 3 4 5 
302

:0using9

:0namespace6

Level Order traversal of binary tree is 
1 2 3 4 5 
307using26namespace31

using86

Level Order traversal of binary tree is 
1 2 3 4 5 
311

:0using9

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0public namespace46
Level Order traversal of binary tree is 
1 2 3 4 5 
6 namespace48

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
326
Level Order traversal of binary tree is 
1 2 3 4 5 
12 namespace54

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
330
Level Order traversal of binary tree is 
1 2 3 4 5 
12 using17using54using01

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
336
Level Order traversal of binary tree is 
1 2 3 4 5 
12 using17namespace65using01

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
342
Level Order traversal of binary tree is 
1 2 3 4 5 
12 using17namespace71using01

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
348
Level Order traversal of binary tree is 
1 2 3 4 5 
12 using17namespace777using01

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
354
Level Order traversal of binary tree is 
1 2 3 4 5 
12 using17namespace83using01

using7namespace86

Level Order traversal of binary tree is 
1 2 3 4 5 
361using01

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
364

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

Python3

class namespace98

____10std;00 std;01std;022

Các

using7std;025____511std;07 std;13

using7std;022516std;07 std;13

std;00 std;20

____10namespace6 std;42std;43 std;13:

using7namespace9

____10

Level Order traversal of binary tree is 
1 2 3 4 5 
401std;07
Level Order traversal of binary tree is 
1 2 3 4 5 
403

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
405

Level Order traversal of binary tree is 
1 2 3 4 5 
0:99#include 07
Level Order traversal of binary tree is 
1 2 3 4 5 
409
Level Order traversal of binary tree is 
1 2 3 4 5 
410using72std;35

using7std;56

Level Order traversal of binary tree is 
1 2 3 4 5 
415using72
Level Order traversal of binary tree is 
1 2 3 4 5 
417std;07 std;6using69

using7std;80std;07

Level Order traversal of binary tree is 
1 2 3 4 5 
424using72using69

using7namespace6

Level Order traversal of binary tree is 
1 2 3 4 5 
429std;43
Level Order traversal of binary tree is 
1 2 3 4 5 
431 std;13:9

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
435

using7namespace6

Level Order traversal of binary tree is 
1 2 3 4 5 
438std;43
Level Order traversal of binary tree is 
1 2 3 4 5 
431 std;13:9

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
444

std;42std;07 using17using54using69

class19std;07 using17namespace65using69

class24std;07 using17namespace71using69

class29std;07 using17namespace77using69

class34std;07 using17namespace83using69

std;56#include 07

Level Order traversal of binary tree is 
1 2 3 4 5 
472using69

class43

C#

using class45

using

Level Order traversal of binary tree is 
1 2 3 4 5 
478

public class using09

Level Order traversal of binary tree is 
1 2 3 4 5 
0__
Level Order traversal of binary tree is 
1 2 3 4 5 
1
Level Order traversal of binary tree is 
1 2 3 4 5 
2

Level Order traversal of binary tree is 
1 2 3 4 5 
0public using14

Level Order traversal of binary tree is 
1 2 3 4 5 
0____8 using17
Level Order traversal of binary tree is 
1 2 3 4 5 
1 using19

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7using23

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
262using26std;0

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
266using26std;0

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

public class using32

Level Order traversal of binary tree is 
1 2 3 4 5 
0using34

Level Order traversal of binary tree is 
1 2 3 4 5 
0
Level Order traversal of binary tree is 
1 2 3 4 5 
6 using42

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
282
Level Order traversal of binary tree is 
1 2 3 4 5 
12
Level Order traversal of binary tree is 
1 2 3 4 5 
522

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
524

using7:99

Level Order traversal of binary tree is 
1 2 3 4 5 
527

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
529

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
531std;6using01

:0namespace6

Level Order traversal of binary tree is 
1 2 3 4 5 
298using26namespace31

using86

Level Order traversal of binary tree is 
1 2 3 4 5 
540

:0using9

:0namespace6

Level Order traversal of binary tree is 
1 2 3 4 5 
307using26namespace31

using86

Level Order traversal of binary tree is 
1 2 3 4 5 
549

:0using9

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0public namespace46
Level Order traversal of binary tree is 
1 2 3 4 5 
6
Level Order traversal of binary tree is 
1 2 3 4 5 
560

Level Order traversal of binary tree is 
1 2 3 4 5 
0#include 7

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
326
Level Order traversal of binary tree is 
1 2 3 4 5 
12 namespace54

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
330
Level Order traversal of binary tree is 
1 2 3 4 5 
12 public08

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
336
Level Order traversal of binary tree is 
1 2 3 4 5 
12 public12

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
342
Level Order traversal of binary tree is 
1 2 3 4 5 
12 public16

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
348
Level Order traversal of binary tree is 
1 2 3 4 5 
12 public20

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
354
Level Order traversal of binary tree is 
1 2 3 4 5 
12 public24

using7public26public27

public28namespace89

Level Order traversal of binary tree is 
1 2 3 4 5 
592using01

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
364

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

JavaScript

public37

public39

Level Order traversal of binary tree is 
1 2 3 4 5 
0public41

using7public43public44

using7public43public47using26std;0

using7public43public52using26std;0

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0public65 public66

using7public60

Level Order traversal of binary tree is 
1 2 3 4 5 
624

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
626

using7:99

Level Order traversal of binary tree is 
1 2 3 4 5 
629

:0public60

Level Order traversal of binary tree is 
1 2 3 4 5 
632

:0

Level Order traversal of binary tree is 
1 2 3 4 5 
634std;6using01

:0namespace6

Level Order traversal of binary tree is 
1 2 3 4 5 
298using26namespace31

using86

Level Order traversal of binary tree is 
1 2 3 4 5 
643

:0using9

:0namespace6

Level Order traversal of binary tree is 
1 2 3 4 5 
307using26namespace31

using86

Level Order traversal of binary tree is 
1 2 3 4 5 
652

:0using9

using7using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0using9

Level Order traversal of binary tree is 
1 2 3 4 5 
0public namespace46
Level Order traversal of binary tree is 
1 2 3 4 5 
6
Level Order traversal of binary tree is 
1 2 3 4 5 
560

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
326
Level Order traversal of binary tree is 
1 2 3 4 5 
12 namespace54

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
330
Level Order traversal of binary tree is 
1 2 3 4 5 
12 public08

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
336
Level Order traversal of binary tree is 
1 2 3 4 5 
12 public12

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
342
Level Order traversal of binary tree is 
1 2 3 4 5 
12 public16

using7:66

Level Order traversal of binary tree is 
1 2 3 4 5 
361using01

using7:70

:71

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
348
Level Order traversal of binary tree is 
1 2 3 4 5 
12 public20

Level Order traversal of binary tree is 
1 2 3 4 5 

using7

Level Order traversal of binary tree is 
1 2 3 4 5 
354
Level Order traversal of binary tree is 
1 2 3 4 5 
12 public24
O(N) where n is the number of nodes in the binary tree.
Auxiliary Space: O(N) where n is the number of nodes in the binary tree.

JavaScript


Làm thế nào để bạn in một cây nhị phân theo thứ tự cấp?

Đơn hàng cấp độ của cây nhị phân bằng cách sử dụng đệ quy: Tìm chiều cao của cây và chạy độ sâu tìm kiếm đầu tiên và duy trì chiều cao hiện tại, in các nút cho mọi chiều cao từ rễ và cho chiều cao và khớp nếu chiều cao hiện tại bằng chiều cao của lần lặp sau đó in nút của nút dữ liệu.

Làm thế nào để bạn in các nút của cấp độ cây khôn ngoan?

Thuật toán để in các nút ở mức nhất định nếu mức của nút hiện tại bằng L thì chúng ta sẽ in nó trên màn hình khác tiếp tục chuyển giao hàng trước. Nếu nút bằng null, return. Nếu mức của nút bằng L, thì in nút và trả về. Các cây con đệ quy và bên phải ở cấp L + 1.If level of current node is equal to L then we will print it on screen else continue pre order traversal. If node is equal to NULL, return. If level of node is equal to L, then print node and return. Recursively traverse left and right sub trees at level L + 1.

Làm thế nào để bạn đi qua một cái cây theo cấp độ?

Tìm kiếm này được gọi là tìm kiếm thứ tự thứ tự hoặc tìm kiếm đầu tiên (BFS), vì cây tìm kiếm được mở rộng càng nhiều càng tốt trên mỗi độ sâu trước khi đi đến độ sâu tiếp theo.Một giải pháp đơn giản là in tất cả các nút của cấp 1 trước tiên, theo sau là cấp 2, cho đến cấp độ H, trong đó h là chiều cao của cây.print all nodes of level 1 first, followed by level 2, until level h , where h is the tree's height.

Làm thế nào để bạn tìm thấy mức độ của một cây nhị phân?

Để tính toán mức độ của một cây nhị phân, chúng ta có thể đi qua từng cấp độ cây.Chúng tôi bắt đầu với nút gốc là cấp 0. Sau đó, chúng tôi truy cập mọi nút ở cấp độ trước khi đi đến một cấp độ khác.Ví dụ, trình tự truyền tải theo cấp độ của cây ví dụ trên là 1, 2, 3, 4, 5.traverse the tree level-by-level. We start with the root node as level 0. Then we visit every node on a level before going to another level. For example, the level-by-level traversal sequence of the above example tree is 1, 2, 3, 4, 5.