Microsoft question 100 - do it every day - question 16

Course content ： Various k8s Deployment way . Include minikube Deploy ,kubeadm Deploy ,kubeasz Deploy ,rancher Deploy ,k3s Deploy . Including development and test environment deployment k8s, And production environment deployment k8s.

Tencent classroom connection address https://ke.qq.com/course/478827?taid=4373109931462251&tuin=ba64518

Tencent classroom connection address https://ke.qq.com/course/484107?tuin=ba64518

Introduce the main k8s Resource usage configuration and commands . Include configmap,pod,service,replicaset,namespace,deployment,daemonset,ingress,pv,pvc,sc,role,rolebinding,clusterrole,clusterrolebinding,secret,serviceaccount,statefulset,job,cronjob,podDisruptionbudget,podSecurityPolicy,networkPolicy,resourceQuota,limitrange,endpoint,event,conponentstatus,node,apiservice,controllerRevision etc. .

Detailed introduction helm command , Study helm chart grammar , To write helm chart. In depth analysis of the source code of each project , Learn to write helm plug-in unit
————————————————------------------------------------------------------------------------------------------------------------------

The first 16 topic （ Trees ）：
subject （ Microsoft ）：
Enter a binary tree , Print each node of the tree in layers from top to bottom , Print from left to right in the same layer .  
For example, the input

Log in and copy

      
      

       
       8
       
       
   / /
       
       
  6 10
       
       
 / / / /
       
       
 5 7 9 11
      
      
      
      

       
       
1.
       
       
2.
       
       
3.
       
       
4.
       
       
5.
      
      

Output 8 6 10 5 7 9 11.

 

 

Log in and copy

      
      

       
       package 
       
       com.
       
       microsoft;
       
       

       
       

       
       import 
       
       java.
       
       util.
       
       ArrayList;
       
       

       
       import 
       
       java.
       
       util.
       
       List;
       
       

       
       import 
       
       java.
       
       util.
       
       Random;
       
       

       
       

       
       public 
       
       class 
       
       TreeLeverPrint {
       
       
  
       
       private 
       
       Node 
       
       root;
       
       
  
       
       public 
       
       TreeLeverPrint(
       
       int []
       
       data){
       
       
    
       
       for(
       
       int 
       
       i
       
       =
       
       0;
       
       i
       
       <
       
       data.
       
       length;
       
       i
       
       ++){
       
       
      
       
       Node 
       
       node
       
       =
       
       new 
       
       Node();
       
       
      
       
       node.
       
       value
       
       =
       
       data[
       
       i];
       
       
      
       
       if(
       
       root
       
       ==
       
       null){
       
       
        
       
       root
       
       =
       
       node;
       
       
      }
       
       else{
       
       
        
       
       insert(
       
       root,
       
       node);
       
       
      }
       
       
    }
       
       
  }
       
       
  
       
       public 
       
       void 
       
       printLever(){
       
       
    
       
       List
       
       <
       
       Node
       
       > 
       
       nodeList
       
       =
       
       new 
       
       ArrayList
       
       <
       
       Node
       
       >();
       
       
    
       
       nodeList.
       
       add(
       
       root);
       
       
    
       
       printLever(
       
       nodeList);
       
       
  }
       
       
  
       
       public 
       
       void 
       
       printLever(
       
       List
       
       <
       
       Node
       
       > 
       
       parentList){
       
       
    
       
       if(
       
       parentList.
       
       size()
       
       ==
       
       0){
       
       
      
       
       return;
       
       
    }
       
       
    
       
       List
       
       <
       
       Node
       
       > 
       
       nextLeverList
       
       =
       
       new 
       
       ArrayList
       
       <
       
       Node
       
       >();
       
       
    
       
       for(
       
       int 
       
       i
       
       =
       
       0;
       
       i
       
       <
       
       parentList.
       
       size();
       
       i
       
       ++){
       
       
      
       
       Node 
       
       parent
       
       =
       
       parentList.
       
       get(
       
       i);
       
       
      
       
       System.
       
       out.
       
       print(
       
       parent.
       
       value
       
       +
       
       " ");
       
       
      
       
       if(
       
       parent.
       
       left
       
       !=
       
       null){
       
       
        
       
       nextLeverList.
       
       add(
       
       parent.
       
       left);
       
       
      }
       
       
      
       
       if(
       
       parent.
       
       right
       
       !=
       
       null){
       
       
        
       
       nextLeverList.
       
       add(
       
       parent.
       
       right);
       
       
      }
       
       
    }
       
       
    
       
       printLever(
       
       nextLeverList);
       
       
    
       
       
  }
       
       
  
       
       private 
       
       void 
       
       insert(
       
       Node 
       
       parent,
       
       Node 
       
       node){
       
       
    
       
       int 
       
       random
       
       =
       
       new 
       
       Random().
       
       nextInt(
       
       2);
       
       
    
       
       if(
       
       random
       
       ==
       
       1){
       
       
      
       
       if(
       
       parent.
       
       left
       
       !=
       
       null){
       
       
        
       
       insert(
       
       parent.
       
       left,
       
       node);
       
       
      }
       
       else{
       
       
        
       
       parent.
       
       left
       
       =
       
       node;
       
       
        
       
       node.
       
       lever
       
       =
       
       parent.
       
       lever
       
       +
       
       1;
       
       
      }
       
       
    }
       
       else{
       
       
      
       
       if(
       
       parent.
       
       right
       
       !=
       
       null){
       
       
        
       
       insert(
       
       parent.
       
       right,
       
       node);
       
       
      }
       
       else{
       
       
        
       
       parent.
       
       right
       
       =
       
       node;
       
       
        
       
       node.
       
       lever
       
       =
       
       parent.
       
       lever
       
       +
       
       1;
       
       
      }
       
       
    }
       
       
  }
       
       
  
       
       public 
       
       void 
       
       print() {
       
       
    
       
       Node 
       
       h 
       
       = 
       
       this.
       
       root;
       
       
    
       
       this.
       
       print(
       
       0, 
       
       h);
       
       
  }
       
       

       
       
  
       
       private 
       
       void 
       
       print(
       
       int 
       
       level, 
       
       Node 
       
       node) {
       
       
    
       
       if(
       
       node
       
       ==
       
       null){
       
       
      
       
       return;
       
       
    }
       
       
    
       
       for (
       
       int 
       
       i 
       
       = 
       
       0; 
       
       i 
       
       < 
       
       level; 
       
       i
       
       ++) {
       
       
      
       
       System.
       
       out.
       
       format(
       
       " ");
       
       
    }
       
       
    
       
       System.
       
       out.
       
       format(
       
       "|");
       
       
    
       
       for (
       
       int 
       
       i 
       
       = 
       
       0; 
       
       i 
       
       < 
       
       level; 
       
       i
       
       ++) {
       
       
      
       
       System.
       
       out.
       
       format(
       
       "-");
       
       
    }
       
       

       
       
    
       
       System.
       
       out.
       
       format(
       
       "%d%s%n", 
       
       node.
       
       value,
       
       ","
       
       +
       
       node.
       
       lever);
       
       
    
       
       print(
       
       level 
       
       + 
       
       1, 
       
       node.
       
       left);
       
       
    
       
       print(
       
       level
       
       +
       
       1,
       
       node.
       
       right);
       
       
    
       
       
  }
       
       
  
       
       private 
       
       class 
       
       Node{
       
       
    
       
       private 
       
       Node 
       
       left;
       
       
    
       
       private 
       
       Node 
       
       right;
       
       
    
       
       private 
       
       int 
       
       value;
       
       
    
       
       private 
       
       int 
       
       lever;
       
       
  }
       
       
  
       
       public 
       
       static 
       
       void 
       
       main(
       
       String[] 
       
       args) {
       
       
    
       
       int []
       
       data
       
       =
       
       new 
       
       int[]{
       
       1,
       
       2,
       
       3,
       
       4,
       
       5,
       
       6,
       
       7,
       
       8,
       
       9,
       
       10};
       
       
    
       
       TreeLeverPrint 
       
       tree
       
       =
       
       new 
       
       TreeLeverPrint(
       
       data);
       
       
    
       
       tree.
       
       print();
       
       
    
       
       tree.
       
       printLever();
       
       
  }
       
       

       
       
}
      
      
      
      

       
       
1.
       
       
2.
       
       
3.
       
       
4.
       
       
5.
       
       
6.
       
       
7.
       
       
8.
       
       
9.
       
       
10.
       
       
11.
       
       
12.
       
       
13.
       
       
14.
       
       
15.
       
       
16.
       
       
17.
       
       
18.
       
       
19.
       
       
20.
       
       
21.
       
       
22.
       
       
23.
       
       
24.
       
       
25.
       
       
26.
       
       
27.
       
       
28.
       
       
29.
       
       
30.
       
       
31.
       
       
32.
       
       
33.
       
       
34.
       
       
35.
       
       
36.
       
       
37.
       
       
38.
       
       
39.
       
       
40.
       
       
41.
       
       
42.
       
       
43.
       
       
44.
       
       
45.
       
       
46.
       
       
47.
       
       
48.
       
       
49.
       
       
50.
       
       
51.
       
       
52.
       
       
53.
       
       
54.
       
       
55.
       
       
56.
       
       
57.
       
       
58.
       
       
59.
       
       
60.
       
       
61.
       
       
62.
       
       
63.
       
       
64.
       
       
65.
       
       
66.
       
       
67.
       
       
68.
       
       
69.
       
       
70.
       
       
71.
       
       
72.
       
       
73.
       
       
74.
       
       
75.
       
       
76.
       
       
77.
       
       
78.
       
       
79.
       
       
80.
       
       
81.
       
       
82.
       
       
83.
       
       
84.
       
       
85.
       
       
86.
       
       
87.
       
       
88.
       
       
89.
       
       
90.
       
       
91.
       
       
92.
       
       
93.
       
       
94.
       
       
95.
       
       
96.